CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE Concurrency Computat.: Pract. Exper. 2013; 25:1816–1842 Published online 4 March 2013 in Wiley Online Library (wileyonlinelibrary.com). DOI: cpe.3003 SPECIAL

Source URL: www.cloudbus.org

• Planning
• Scheduling algorithms
• Groupware
• Workflow
• Scheduling
• Resource
• Schedule
• Workflow technology
• Management
• Business

SOFTWARE-PRACTICE AND EXPERIENCE Softw. Pract. Exper. 2014; 44:163–174 Published online 23 November 2012 in Wiley Online Library (wileyonlinelibrary.com). DOI: spe.2163 Bandwidth-aware divisible task scheduling

Source URL: www.cloudbus.org

• Planning
• Scheduling algorithms
• Operations research
• Scheduling
• Parallel computing
• Virtual machine
• Hypervisor
• Distributed computing
• Cloud computing
• System software
• Computing
• Software

50 A New Upper Boundon 2D Online Bin Packing XIN HAN, Dalian University of Technology FRANCIS Y. L. CHIN and HING-FUNG TING, The University of Hong Kong GUOCHUAN ZHANG, Zhejiang University

Source URL: i.cs.hku.hk

• Bin packing problem
• Analysis of algorithms
• Algorithm
• Approximation algorithm
• Packing problem
• Randomized algorithm
• Theoretical computer science
• Mathematics
• Applied mathematics

On-the-Fly Verification of Rateless Erasure Codes for Efficient Content Distribution Maxwell N. Krohn Michael J. Freedman

Source URL: www.scs.stanford.edu

• Search algorithms
• Coding theory
• Information theory
• Mathematics
• Information retrieval
• Hash function
• Online codes
• Hash list
• Hash tree
• Cryptographic hash functions
• Error detection and correction
• Hashing

A General Approach to Online Network Optimization Problems Noga Alon∗ Baruch Awerbuch† Yossi Azar‡

Source URL: www.cs.jhu.edu

• Combinatorial optimization
• NP-complete problems
• Spanning tree
• Analysis of algorithms
• Algorithms
• Randomized rounding
• Maximum flow problem
• Shortest path problem
• Steiner tree problem
• Theoretical computer science
• Mathematics
• Computational complexity theory

Online Discovery of Top-k Similar Motifs in Time Series Data Hoang Thanh Lam1 , Ninh Dang Pham2 and Toon Calders1 1 Department of Math. and Computer Science

Source URL: www.itu.dk

• Search algorithms
• Analysis of algorithms
• K-nearest neighbor algorithm
• Time complexity
• Pi
• Algorithm
• Nearest neighbor search
• Euclidean algorithm
• Theoretical computer science
• Mathematics
• Applied mathematics

Online Algorithms for Geographical Load Balancing Minghong Lin∗ , Zhenhua Liu∗ , Adam Wierman∗ , Lachlan L. H. Andrew† ∗ California Institute of Technology, Email: {mhlin,zhenhua,adamw}@caltech.edu † Swinburn

Source URL: www.caia.swin.edu.au

The Online Set Cover Problem (Extended Abstract) Noga Alon∗ Baruch Awerbuch†

Source URL: www.cs.jhu.edu

• Analysis of algorithms
• NP-complete problems
• Probabilistic complexity theory
• Randomized algorithm
• Set cover problem
• Competitive analysis
• Algorithm
• Randomized rounding
• Euclidean algorithm
• Mathematics
• Theoretical computer science
• Applied mathematics

This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and education use, including for instruction at the author’s institution, sharing with colleag

Source URL: i.cs.hku.hk

• Mathematical optimization
• Job shop scheduling
• Computer science
• Analysis of algorithms
• Online algorithms
• Scheduling
• Job scheduler
• Competitive analysis
• Algorithm
• Operations research
• Applied mathematics
• Mathematics

Throughput-Competitive On-Line Routing Baruch Awerbuch∗ Lab. for Computer Science MIT Yossi Azar†

Source URL: www.cs.jhu.edu

• Competitive analysis
• Mathematics
• Online algorithms
• Exponential growth
• Exponentials